Memetic Algorithms in Discrete Optimization
نویسنده
چکیده
This chapter is dedicated to Memetic Algorithms for Discrete Optimization. It begins with a general survey, and then explains in depth the key ingredients of a successful MA. A particular attention is given to the following issues: Design of semantic combination operators, development of dedicated local search procedures and management of population diversity. Several other important issues are also discussed such as design of rich evaluation function and constraint handling techniques. This chapter includes two case studies with the purpose of showing how these issues can be effectively implemented in practice.
منابع مشابه
A NEW MEMETIC SWARM OPTIMIZATION FOR SPECTRAL LAYOUT DESIGN OF BRACED FRAMES
For most practical purposes, true topology optimization of a braced frame should be synchronized with its sizing. An integrated layout optimization is formulated here to simultaneously account for both member sizing and bracings’ topology in such a problem. Code-specific seismic design spectrum is applied to unify the earthquake excitation. The problem is solved for minimal structural weight un...
متن کاملA Parallel Memetic Library for Optimization Problems
To solve real-world discrete optimization problems approximately metaheuristics such as memetic algorithms and other evolutionary and local search methods are commonly used. For large instances of these problems or those with a lot of hard constraints even fast heuristics require a considerable amount of computational time. We present PARA.MENOAS, an object oriented memetic algorithms library b...
متن کاملMemetic Algorithms for Discrete Optimization
This chapter is dedicated to Memetic Algorithms for Discrete Optimization. It begins with a general survey, and then explains in depth the key ingredients of a successful MA. A particular attention is given to the following issues: Design of semantic combination operators, development of dedicated local search procedures and management of population diversity. Several other important issues are...
متن کاملMemetic Algorithms in Continuous Optimization
Intuitively, a set is considered to be discrete if it is composed of isolated elements, whereas it is considered to be continuous if it is composed of infinite and contiguous elements and does not contain “holes”. More formally, to introduce the concept of continuous optimization, some preliminary definitions are required. If we consider sub-sets of real numbers, where the partial order is obvi...
متن کاملNew optimization techniques in engineering
Chapter 2: An Introduction to Genetic Algorithms for Engineering Applications Chapter 3: Memetic Algorithms Chapter 4: Scatter Search and Path Relinking: Foundations and Advanced Designs Chapter 5: Ant Colony Optimization Chapter 6: Differential Evolution Chapter 7: SOMA-Self-Organizing Migrating Algorithm Chapter 8: Discrete Particle Swarm Optimization:Illustrated by the Traveling Salesman Pro...
متن کامل